f(x, c(y)) → f(x, s(f(y, y)))
f(s(x), y) → f(x, s(c(y)))
↳ QTRS
↳ DependencyPairsProof
f(x, c(y)) → f(x, s(f(y, y)))
f(s(x), y) → f(x, s(c(y)))
F(s(x), y) → F(x, s(c(y)))
F(x, c(y)) → F(x, s(f(y, y)))
F(x, c(y)) → F(y, y)
f(x, c(y)) → f(x, s(f(y, y)))
f(s(x), y) → f(x, s(c(y)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
F(s(x), y) → F(x, s(c(y)))
F(x, c(y)) → F(x, s(f(y, y)))
F(x, c(y)) → F(y, y)
f(x, c(y)) → f(x, s(f(y, y)))
f(s(x), y) → f(x, s(c(y)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
F(s(x), y) → F(x, s(c(y)))
f(x, c(y)) → f(x, s(f(y, y)))
f(s(x), y) → f(x, s(c(y)))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
F(s(x), y) → F(x, s(c(y)))
The value of delta used in the strict ordering is 1/4.
POL(c(x1)) = 0
POL(s(x1)) = 1 + x_1
POL(F(x1, x2)) = (1/4)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
f(x, c(y)) → f(x, s(f(y, y)))
f(s(x), y) → f(x, s(c(y)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
F(x, c(y)) → F(y, y)
f(x, c(y)) → f(x, s(f(y, y)))
f(s(x), y) → f(x, s(c(y)))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
F(x, c(y)) → F(y, y)
The value of delta used in the strict ordering is 8.
POL(c(x1)) = 2 + (4)x_1
POL(F(x1, x2)) = (4)x_2
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
f(x, c(y)) → f(x, s(f(y, y)))
f(s(x), y) → f(x, s(c(y)))